Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
نویسندگان
چکیده
منابع مشابه
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. – i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj . If we know interval bounds on some such characteristics ai ≤ ci(p) ≤ ai, and we are interested in a characteristic c(p),...
متن کاملAdding Unimodality or Independence Makes Interval Probability Problems NP-Hard
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. – i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj . If we know interval bounds on some such characteristics ai ≤ ci(p) ≤ ai, and we are interested in a characteristic c(p),...
متن کاملA bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems
It is known that interval computations are NP-hard. In other words, the solution of many important problems can be reduced to interval computations. The immediate conclusion is negative: in the general case, one cannot expect an algorithm to do all the interval computations in less than exponential running time. We show that this result also has a bright side: since there are many heuristics fo...
متن کاملIndependence in Generalized Interval Probability
Recently we proposed a new form of imprecise probability based on the generalized interval, where the probabilistic calculus structure resembles the traditional one in the precise probability because of the Kaucher arithmetic. In this paper, we study the independence properties of the generalized interval probability. It resembles the stochastic independence with proper and improper intervals a...
متن کاملOn NP-hardness of the clique partition - Independence number gap recognition and related problems
We show that for a graph G it is NP-hard to decide whether its independence number (G) equals its clique partition number (G) even when some minimum clique partition of G is given. This implies that any (G)-upper bound provably better than (G) is NPhard to compute. To establish this result we use a reduction of the quasigroup completion problem (QCP, known to be NP-complete) to the maximum inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reliable Computing
سال: 2006
ISSN: 1385-3139,1573-1340
DOI: 10.1007/s11155-006-9031-4